Deep Hashing Based on Class-Discriminated Neighborhood Embedding
نویسندگان
چکیده
منابع مشابه
Class-Wise Supervised Hashing with Label Embedding and Active Bits
Learning to hash has become a crucial technique for big data analytics. Among existing methods, supervised learning approaches play an important role as they can produce compact codes and enable semantic search. However, the size of an instancepairwise similarity matrix used in most supervised hashing methods is quadratic to the size of labeled training data, which is very expensive in terms of...
متن کاملDeep Class-Wise Hashing: Semantics-Preserving Hashing via Class-wise Loss
Deep supervised hashing has emerged as an influential solution to large-scale semantic image retrieval problems in computer vision. In the light of recent progress, convolutional neural network based hashing methods typically seek pair-wise or triplet labels to conduct the similarity preserving learning. However, complex semantic concepts of visual contents are hard to capture by similar/dissim...
متن کاملRecognition Based on Metric-optimized Neighborhood Preserving Embedding
Face recognition is a biometric technology with great developable potential. It has a great deal of potential applications in public security and information security. To overcome the problem in the highdimensional face data processing, the k-nearest neighbors is chose by Linear Discriminate Analysis (LDA). A Metric-optimized is proposed for Neighborhood Preserving Embedding (MONPE). MONPE algo...
متن کاملGraph Embedding Algorithms Based on Neighborhood Discriminant Embedding for Face Recognition
This paper explores the use of a series of Graph Embedding (GE) algorithms based on Neighborhood Discriminant Embedding (NDE) as a means to improve the performance and robustness of face recognition. NDE combines GE framework and Fishers criterion and it takes into account the Individual Discriminative Factor (IDF) which is proposed to describe the microscopic discriminative property of each sa...
متن کاملDeep Residual Hashing
Hashing aims at generating highly compact similarity preserving code words which are well suited for large-scale image retrieval tasks. Most existing hashing methods first encode the images as a vector of hand-crafted features followed by a separate binarization step to generate hash codes. This two-stage process may produce sub-optimal encoding. In this paper, for the first time, we propose a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
سال: 2020
ISSN: 1939-1404,2151-1535
DOI: 10.1109/jstars.2020.3027954